On graph invariants given by linear recurrence relations
نویسندگان
چکیده
منابع مشابه
Linear Recurrence Relations for Graph Polynomials
A sequence of graphs Gn is iteratively constructible if it can be built from an initial labeled graph by means of a repeated fixed succession of elementary operations involving addition of vertices and edges, deletion of edges, and relabelings. Let Gn be a iteratively constructible sequence of graphs. In a recent paper, [27], M. Noy and A. Ribò have proven linear recurrences with polynomial coe...
متن کاملNew distance-based graph invariants and relations among them
The eccentricity of a vertex is the maximum distance from it to another vertex, and the average eccentricity of a graph is the mean eccentricity of a vertex. In this paper we introduce average edge and average vertex-edge mean eccentricities of a graph. Moreover, relations among these eccentricities for trees are provided as well as formulas for line graphs and cartesian product of graphs. In t...
متن کاملOn Sequences of Numbers and Polynomials Defined by Linear Recurrence Relations of Order 2
Here we present a new method to construct the explicit formula of a sequence of numbers and polynomials generated by a linear recurrence relation of order 2. The applications of the method to the Fibonacci and Lucas numbers, Chebyshev polynomials, the generalized Gegenbauer-Humbert polynomials are also discussed. The derived idea provides a general method to construct identities of number or po...
متن کاملChecking Linear Duration Invariants by Linear Programming
In this paper, the problem of verifying a timed automaton for a Duration Calculus formula in the form of linear duration invariants 2] is addressed. We show that by linear programming, a particular class of timed automata including the class of real-time automata as a proper subset, can be checked for linear duration invariants. The so-called real-time regular expressions is introduced to expre...
متن کاملPolynomial Invariants by Linear Algebra
We present in this paper a new technique for generating polynomial invariants, divided in two independent parts : a procedure that reduces polynomial assignments composed loops analysis to linear loops under certain hypotheses and a procedure for generating inductive invariants for linear loops. Both of these techniques have a polynomial complexity for a bounded number of variables and we guara...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1990
ISSN: 0095-8956
DOI: 10.1016/0095-8956(90)90127-l